Parameterizing a Groundness Analysis of Logic Programs

نویسنده

  • Lunjin Lu
چکیده

We present a parametric groundness analysis whose input and output are parameterized by a set of groundness parameters. The result of the analysis can be instantiated for different uses of the program. It can also be used to derive sufficient conditions for safely removing groundness checks for built-in calls in the program. The parametric groundness analysis is obtained by generalizing a non-parametric groundness analysis that uses the abstract domain Con. It is shown to be as precise as the non-parametric groundness analysis for any possible values for the groundness parameters. Experimental results of a prototype implementation of the parametric groundness analysis are given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Groundness Analysis for Logic Programs

One of the most attractive features of logic programs is that arguments may be used bidirectionally, as input or output at run-time. However, the compiler must generate code for various alternatives, hence considerable slowdown of execution. In this paper we provide static analysis for groundness; that is, inference of whether the arguments are instantiated to ground terms through run-time. Tho...

متن کامل

A Polymorphic Groundness Analysis of Logic Programs

A polymorphic analysis is an analysis whose input and output contain parameters which serve as placeholders for information that is unknown before analysis but provided after analysis. In this paper, we present a polymorphic groundness analysis that infers parameterised groundness descriptions of the variables of interest at a program point. The polymorphic groundness analysis is designed by re...

متن کامل

Logical Optimality of Groundness Analysis

In the context of the abstract interpretation theory, we study the relations among various abstract domains for groundness analysis of logic programs. We reconstruct the well-known domain Pos as a logical domain in a fully automatic way and we prove that it is the best abstract domain which can be set up from the property of groundness by applying logic operators only. We propose a new notion o...

متن کامل

Efficient Computation of the Reduced Product of Groundness and Sharing Analyses

We identify situations where computation of the reduced product of program analyses can be made more efficient and present a method for efficiently computing the reduced products of program analyses in these situations. The method gives rise to big efficiency gains when applied to computing the reduced product of groundness and pair sharing analyses which provide indispensable information for p...

متن کامل

Correct Answers for First Order Logic

Working within a semantic framework for sequent calculi developed in [3], we propose a couple of extensions to the concepts of correct answers and correct resultants which can be applied to the full first order logic. With respect to previous proposals, this is based on proof theory rather than model theory. We motivate our choice with several examples and we show how to use correct answers to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001